Word Values in Finite Groups
نویسندگان
چکیده
Let w = w(x1, ..., xd) denote a group word in d variables, that is, an element of the free group of rank d. For a finite group G we may define a word map that sends a d-tuple, (g1, ..., gd) of elements of G, to its w-value, w(g1, ..., gd), by substituting variables and evaluating the word in G by performing all relevant group operations. In this thesis we study a number of problems to do with the behaviour of word maps over various classes of groups. The first problem we look at concerns the distribution of word values in nilpotent groups. We obtain a lower bound for the probability that a random d-tuple of elements from any nilpotent group of class 2 evaluates at the identity for any fixed word in d variables answering a special case of a question of Alon Amit [1]. Another problem we look at deals with the question of which possible subsets of a group can be obtained as the image of a word map. This was first studied by Kassabov & Nikolov [15] and later by Lubotzky [22] who gave a complete description in the case of simple groups. We obtain a partial classification for the almost simple groups and quasisimple groups and completely describe what happens in the case of symmetric groups. Finally, we study twisted commutator maps over the alternating groups, special linear groups and special unitary groups. Twisted commutators are similar to commutators but are twisted by group automorphisms. These have been studied by Nikolov & Segal in [29] where they obtain bounds on the width of twisted commutator words over the finite quasisimple groups. Our goal is to improve these bounds. Throughout this thesis we will also look at variations of the above problems as well as related questions.
منابع مشابه
1 1 Ja n 20 07 WORD MAPS AND WARING TYPE PROBLEMS
Waring's classical problem deals with expressing every natural number as a sum of g(k) kth powers. Recently there has been considerable interest in similar questions for nonabelian groups, and simple groups in particular. Here the kth power word is replaced by an arbitrary group word w = 1, and the goal is to express group elements as short products of values of w. We give a best possible and s...
متن کاملFinite-Valued Weighted Automata
Any weighted automaton (WA) defines a relation from finite words to values: given an input word, its set of values is obtained as the set of values computed by each accepting run on that word. A WA is k-valued if the relation it defines has degree at most k, i.e., every set of values associated with an input word has cardinality at most k. We investigate the class of quantitative languages defi...
متن کاملOn group equations
Suppose $f$ is a map from a non-empty finite set $X$ to a finite group $G$. Define the map $zeta^f_G: Glongrightarrow mathbb{N}cup {0}$ by $gmapsto |f^{-1}(g)|$. In this article, we show that for a suitable choice of $f$, the map $zeta^f_G$ is a character. We use our results to show that the solution function for the word equation $w(t_1,t_2,dots,t_n)=g$ ($gin G$) is a character, where $w(t_1,...
متن کاملOn Groups admitting a Word whose Values are Engel
Let m,n be positive integers, v a multilinear commutator word and w = vm. We prove that if G is a residually finite group in which all wvalues are n-Engel, then the verbal subgroup w(G) is locally nilpotent. We also examine the question whether this is true in the case where G is locally graded rather than residually finite. We answer the question affirmatively in the case where m = 1. Moreover...
متن کاملOn finitely generated profinite groups, I: strong completeness and uniform bounds
We prove that in every finitely generated profinite group, every subgroup of finite index is open; this implies that the topology on such groups is determined by the algebraic structure. This is deduced from the main result about finite groups: let w be a ‘locally finite’ group word and d ∈ N. Then there exists f = f(w, d) such that in every d-generator finite group G, every element of the verb...
متن کامل